A Simple Heuristic Algorithm to Determine the Set of Closed Surfaces of the Cubic Tensor Polynomial
نویسنده
چکیده
A simple heuristic algorithm, which determines the set of closed surfaces of the cubic tensor polynomial, is proposed. The algorithm is based on the requirement of positive Gaussian curvature (Stoker’s Theorem) for closed surfaces, excluding domains of tensor values, which do not provide closed surface solutions, and focus the search in the remaining domains. The identification of the closed surfaces is an important factor in both theory and applications, such as the failure behavior of anisotropic bodies. An example of applying successfully the algorithm to a material, which has a distinct anisotropic behavior, is presented.
منابع مشابه
ON THE EDGE COVER POLYNOMIAL OF CERTAIN GRAPHS
Let $G$ be a simple graph of order $n$ and size $m$.The edge covering of $G$ is a set of edges such that every vertex of $G$ is incident to at least one edge of the set. The edge cover polynomial of $G$ is the polynomial$E(G,x)=sum_{i=rho(G)}^{m} e(G,i) x^{i}$,where $e(G,i)$ is the number of edge coverings of $G$ of size $i$, and$rho(G)$ is the edge covering number of $G$. In this paper we stud...
متن کاملMinimizing Makespan with Start Time Dependent Jobs in a Two Machine Flow Shop
[if gte mso 9]> The purpose of this paper is to consider the problem of scheduling a set of start time-dependent jobs in a two-machine flow shop, in which the actual processing times of jobs increase linearly according to their starting time. The objective of this problem is to minimize the makespan. The problem is known to be NP-hardness[ah1] ; therefore, there is no polynomial-time algorithm...
متن کاملHeuristic Approach for Specially Structured Two Stage Flow Shop Scheduling to Minimize the Rental Cost, Processing Time, Set Up Time Are Associated with Their Probabilities Including Transportation Time and Job Weightage
The present paper is an attempt to develop a new heuristic algorithm, find the optimal sequence to minimize the utilization time of the machines and hence their rental cost for two stage specially structured flow shop scheduling under specified rental policy in which processing times and set up time are associated with their respective probabilities including transportation time. Further jo...
متن کاملTENSION QUARTIC TRIGONOMETRIC BÉZIER CURVES PRESERVING INTERPOLATION CURVES SHAPE
In this paper simple quartic trigonometric polynomial blending functions, with a tensionparameter, are presented. These type of functions are useful for constructing trigonometricB´ezier curves and surfaces, they can be applied to construct continuous shape preservinginterpolation spline curves with shape parameters. To better visualize objects and graphics atension parameter is included. In th...
متن کاملDesigning a Meta-Heuristic Algorithm Based on a Simple Seeking Logic
Nowadays, in majority of academic contexts, it has been tried to consider the highest possible level of similarities to the real world. Hence, most of the problems have complicated structures. Traditional methods for solving almost all of the mathematical and optimization problems are inefficient. As a result, meta-heuristic algorithms have been employed increasingly during recent years. In thi...
متن کامل